Reducing the Paging Costs under Delay Bound for PCS Networks

In this paper new paging schemes are introduced to reduce paging costs under delay bounds. In general , location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. Three new paging schemes, reverse, semi-reverse and uniform, provide a simple way of partitioning the service areas and accordingly minimize the paging costs based on each mobile terminal's location probability distribution. Numerical results demonstrate signiicant reduction in paging costs for various probability distributions, such as uniform , truncated discrete Gaussian, and irregular distributions .